Practical Cellular Dividers

Absfmcf-The parallel division algorithms discussed in this paper may be classified among modified higher radix nonrestor-ing on-line division methods, where redundant representations are extensively utilized to speed up the operation. The network realizations of these algorithms are cellular, or even systolic with exclusively local control; they have size (area) and time both O (n) , where n is the length of the dividend representation. The same structures can also be used as a signed, digit-serial multiplier. When suitably equipped with some control and a few registers, the dividerhultiplier brings remarkable performance to large modular arithmetic, RSA cryptography, and gcd computations. They are also of interest to the design of floating-point units, and signal processing applications.